Chromatic Number, Induced Cycles, and Non-separating Cycles

Induced Cycles and Chromatic Number

We prove that, for any pair of integers k, l ≥ 1, there exists an integerN(k, l) such that every graph with chromatic number at least N(k, l) contains either Kk or an induced odd cycle of length at least 5 or an induced cycle of length at least l. Given a graph with large chromatic number, it is natural to ask whether it must contain induced subgraphs with particular properties. One possibility...

Non-separating Induced Cycles in Graphs

In this paper we consider non-separating induced cycles in graphs. A basic result is that any 2-connected graph with at least six vertices and without such a cycle has at least four vertices of degree 2, and this is best possible. For any 3-connected graph G we prove that there exists a non-separating induced cycle C, such that all cycles in G V(C) are contained in the same block of G V(C). We ...

A Note on Chromatic Number and Induced Odd Cycles

An odd hole is an induced odd cycle of length at least 5. Scott and Seymour confirmed a conjecture of Gyárfás and proved that if a graph G has no odd holes then χ(G) 6 22 ω(G)+2 . Chudnovsky, Robertson, Seymour and Thomas showed that if G has neither K4 nor odd holes then χ(G) 6 4. In this note, we show that if a graph G has neither triangles nor quadrilaterals, and has no odd holes of length a...

The b-chromatic number of powers of cycles

Strong Oriented Chromatic Number of Planar Graphs without Short Cycles

Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mapping φ from V (G) to M such that φ(u) 6= φ(v) whenever −→uv is an arc in G and φ(v)−φ(u) 6= −(φ(t)−φ(z)) whenever −→uv and zt are two arcs in G. The strong oriented chromatic number of an oriented graph is the minimal order of a group M such that G has an M-strong-oriented coloring. This notion was ...